On primitive elements of finite fields avoiding affine hyperplanes
نویسندگان
چکیده
Let n≥2 be an integer and let Fq the finite field with q elements, where is a prime power. Given Fq-affine hyperplanes A1,…,An of Fqn in general position, we study existence distribution primitive elements Fqn, avoiding each Ai. We obtain both asymptotic concrete results, relating to past works on digits over fields.
منابع مشابه
On primitive elements in finite fields of low characteristic
We discuss the problem of constructing a small subset of a finite field containing primitive elements of the field. Given a finite field, Fqn , small q and large n, we show that the set of all low degree polynomials contains the expected number of primitive elements. The main theorem we prove is a bound for character sums over short intervals in function fields. Our result is unconditional and ...
متن کاملFinding Primitive Elements in Finite Fields of Small Characteristic
We describe a deterministic algorithm for finding a generating element of the multiplicative group of the finite field with p elements. In time polynomial in p and n, the algorithm either outputs an element that is provably a generator or declares that it has failed in finding one. Under a heuristic assumption, we argue that the algorithm does always succeed in finding a generator. The algorith...
متن کاملNormal bases and primitive elements over finite fields
Let q be a prime power, m ≥ 2 an integer and A = ( a b c d ) ∈ GL2(Fq), where A 6= ( 1 1 0 1 ) if q = 2 and m is odd. We prove an extension of the primitive normal basis theorem and its strong version. Namely, we show that, except for an explicit small list of genuine exceptions, for every q, m and A, there exists some primitive x ∈ Fqm such that both x and (ax+b)/(cx+d) produce a normal basis ...
متن کاملPermutations, hyperplanes and polynomials over finite fields
Starting with a result in combinatorial number theory we prove that (apart from a couple of exceptions that can be classified), for any elements a1, . . . , an of GF (q), there are distinct field elements b1, . . . , bn such that a1b1 + · · ·+ anbn = 0. This implies the classification of hyperplanes lying in the union of the hyperplanes Xi = Xj in a vector space over GF (q), and also the classi...
متن کاملOn Finding Primitive Roots in Finite Fields
We show that in any finite field Fq a primitive root can be found in time O(q’ ‘+’ ) Let Fq denote a finite field of q elements. An element 0 E IFq is called a primitive root if it generates the multiplicative group F;,“. We show that a combination of known results on distribution primitive roots and the factorization algorithm of [6] leads to a deterministic algorithm to find a primitive root ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Finite Fields and Their Applications
سال: 2021
ISSN: ['1090-2465', '1071-5797']
DOI: https://doi.org/10.1016/j.ffa.2021.101911